1987- Revised Dependency-directed Backtracking for Default Reasoning
نویسنده
چکیده
Default reasoning is a useful inference technique which involves choosing a single context in which further inferences are to be made. If this choice is incorrect, the context may need to be switched. Dependency-directed backtracking provides a method for such context switching. Doyle’s algorithm for dependency-directed backtracking is revised to allow context switching to be guided by the calling inference system using domain knowledge. This new backtracking mechanism has been implemented as part of software for developing expert systems.
منابع مشابه
Stable Closures, Defeasible Logic and Contradiction Tolerant Reasoning
A solution to the Yale shooting problem has been previously proposed that uses so-called non-normal defaults. This approach produces a single extension. One disadvantage, however, is . that new conflicting information causes the extension to collapse. In this paper we propose a new formal counterpart to the intuitive notion of a reasonable set of beliefs. The new formalization reduces to the pr...
متن کاملNon-Deterministic Lisp with Dependency-directed Backtracking
Extending functional Lisp with McCarthy’s nondeterministic operator AHFJ yields a language which can concisely express search problems. Dependencydirected backtracking is a powerful search strategy. We describe a non-deterministic Lisp dialect called SCHEMER and show that it can provide automatic dependency-directed backtracking. The resulting language provides a convenient interface to this ef...
متن کاملThree-Valued Semantics for Extended Logic Programs
In 4] , the semantics of monotonic (i.e. not-free) extended logic programs (ELPs) has been rephrased in three-valued logic for two purposes: achieving tractable reasoning with incomplete information and understanding the relationships between the existing semantics and many-valued logics. In this paper, we generalize this approach to unrestricted ELPs. We obtain a unifying view of many formalis...
متن کاملTruth Maintenanoe Systems for Problem Solving
This report describes progress that has been made in the ability of a computer system to understand and reason about its own reasoning faculties. A new method for representing knowledge about beliefs has been developed. This representation, called a non-monotonic dependency system, extends several similar previous representation forms for such knowledge, and has been employed in developing new ...
متن کاملDefault Reasoning with Speci cityPhan
We present a new approach to reasoning with speciicity which subsumes inheritance reasoning. The new approach diiers from other approaches in the literature in the way priority between defaults is handled. Here, it is context sensitive rather than context independent as in other approaches. We show that any context independent handling of priorities between defaults as advocated in the literatu...
متن کامل